Introduction to and Survey of Cellular Automata or Polyautomata Theory
نویسندگان
چکیده
Published in: Automata, Languages, Development, eds. A. Lindenmayer and G. Rozenberg, North-Holland Publishing Co., New York, 1976, 405-422, a book which serves as the proceedings of the conference Formal Languages, Automata and Development, Noordwijkerhout, the Netherlands, Apr 1975. I style this conference Artificial Life 0 since it brought together for the first time biological and computer scientists many of whom would later attend the conferences formally known as Artificial Life 1 (ALife1), Artificial Life 2 (ALife2), etc.
منابع مشابه
On Stack-augmented Polyautomata on Stack-augmented Polyautomata
A stack augmented generalization of cellular automata, the pushdown cellular automata, are investigated. We are studying the language accepting capabilities of such devices. Closure properties of real-time, linear-time and unrestricted time language families are shown. The relationships of these families with each other and to languages of sequential automata are considered.
متن کاملIntroduction to and Survey of Cellular Automata or Polyautomata Theory1
Published in: Automata, Languages, Development, eds. A. Lindenmayer and G. Rozenberg, North-Holland Publishing Co., New York, 1976, 405-422, a book which serves as the proceedings of the conference Formal Languages, Automata and Development, Noordwijkerhout, the Netherlands, Apr 1975. I style this conference Artificial Life 0 since it brought together for the first time biological and computer ...
متن کاملMassively Parallel Search for Transition-Tables of Polyautomata
One of the fundamental tasks in automata theory is to look for transition-tables that implement a given speciication. In principle, most of this task can be performed by a computer. But a combinatorial explosion in the number of possible transition-tables quickly renders brute force search impractical. This paper demonstrates two approaches to extend the frontier of tractable problem sizes. Fir...
متن کاملA Gentle Introduction to Stochastic (Poly)Automata Collectives and the (Bio)Chemical Ground Form
We present uniformly four related models for the representation of biochemical systems recently proposed in the literature in different publications. Namely, we consider Stochastic Automata Collectives (SAC) [2], Stochastic Polyautomata Collectives (SPC) [2], Chemical Ground Form (CGF) [3], and Biochemical Ground Form (BGF) [4].
متن کاملNovel Defect Terminolgy Beside Evaluation And Design Fault Tolerant Logic Gates In Quantum-Dot Cellular Automata
Quantum dot Cellular Automata (QCA) is one of the important nano-level technologies for implementation of both combinational and sequential systems. QCA have the potential to achieve low power dissipation and operate high speed at THZ frequencies. However large probability of occurrence fabrication defects in QCA, is a fundamental challenge to use this emerging technology. Because of these vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001